A decoding method of an n length binary BCH code through (n + 1)n length binary cyclic code
نویسندگان
چکیده
منابع مشابه
Statistical Recognition Method of Binary BCH Code
In this paper, a statistical recognition method of the binary BCH code is proposed. The method is applied to both primitive and non-primitive binary BCH code. The block length is first recognized based on the cyclic feature under the condition of the frame length known. And then candidate polynomials are achieved which meet the restrictions. Among the candidate polynomials, the most optimal pol...
متن کاملSome binary BCH codes with length $n=2^m+1$
Under research for near sixty years, Bose-Ray-Chaudhuri-Hocquenghem(BCH) codes have played increasingly important roles in many applications such as communication systems, data storage and information security. However, the dimension and minimum distance of BCH codes are seldom solved until now because of their intractable characteristics. The objective of this paper is to study the dimensions ...
متن کاملA projection decoding of a binary extremal self-dual code of length 40
As far as we know, there is no decoding algorithm of any binary self-dual [40, 20, 8] code except for the syndrome decoding applied to the code directly. This syndrome decoding for a binary self-dual [40, 20, 8] code is not efficient in the sense that it cannot be done by hand due to a large syndrome table. The purpose of this paper is to give two new efficient decoding algorithms for an extrem...
متن کاملQuantum Cyclic Code of length dividing
In this paper, we study cyclic stabiliser codes over Fp of length dividing p + 1 for some positive integer t. We call these t-Frobenius codes or just Frobenius codes for short. We give methods to construct them and show that they have efficient decoding algorithms. An important subclass of stabiliser codes are the linear stabiliser codes. For linear Frobenius codes we have stronger results: We ...
متن کاملA Two-Dimension XML Encoding Method based on Variable Length Binary Code
Recently, the researchers have proposed a number of labeling schemes. In these labeling schemes, the approach which can extract structural information between nodes and process query efficiently is more outstanding. However, most of these labeling schemes do not well support update operations. To achieve update-friendly operations, some of the methods keep intervals between labeling numbers, bu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Anais da Academia Brasileira de Ciências
سال: 2013
ISSN: 0001-3765
DOI: 10.1590/s0001-37652013000300002